#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;

const ll N = 1e6 + 10, INF = 0x3f3f3f3f;

ll n;
vector<pair<ll, ll>> a;

ll dis(pair<ll, ll> a, pair<ll, ll> b)
{
    return max(abs(a.first - b.first), abs(a.second - b.second));
}

void solve()
{
    cin >> n;
    ll mix = INF, mxx = 0, miy = INF, mxy = 0;

    for (ll i = 1;i <= n;i++) {
        ll x, y;cin >> x >> y;
        a.push_back({ x,y });
        mix = min(mix, x);
        mxx = max(mxx, x);
        miy = min(miy, y);
        mxy = max(mxy, y);
    }

    set<pair<ll, ll>> arg;
    arg.insert({ (mix + mxx) / 2,(miy + mxy) / 2 });
    arg.insert({ (mix + mxx + 1) / 2,(miy + mxy) / 2 });
    arg.insert({ (mix + mxx) / 2,(miy + mxy + 1) / 2 });
    arg.insert({ (mix + mxx + 1) / 2,(miy + mxy + 1) / 2 });

    ll ans = INF;
    for (pair<ll, ll> s : arg) {
        ll t = 0;
        for (pair<ll, ll> it : a) {
            t = max(t, dis(it, s));
        }
        ans = min(ans, t);
    }
    cout << ans;
}

signed main()
{
    //ios::sync_with_stdio(0);
    //cin.tie(0);cout.tie(0);
#define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
    std::istringstream in(R"()");
    std::cin.rdbuf(in.rdbuf());
#endif
    ll T = 1;
    //cin>>T;
    for (ll i = 1;i <= T;i++) {
        solve();
    }
}